﻿In computer science, a graph is an abstract data structure that is meant to implement the graph concept from mathematics.

A graph data structure consists mainly of a finite (and possibly mutable) set of ordered pairs, called edges or arcs, of certain entities called nodes or vertices. As in mathematics, an edge (x,y) is said to point or go from x to y. The nodes may be part of the graph structure, or may be external entities represented by integer indices or references.

A graph data structure may also associate to each edge some edge value, such as a symbolic label or a numeric attribute (cost, capacity, length, etc.).

Contents [hide]
1 Operations 
2 Representations 
3 Algorithms 
4 See also 
5 References 
6 Further reading 
7 External links 
 
[edit] OperationsThe basic operations provided by a graph data structure G usually include:

adjacent(G, x, y): tests whether there is an edge from node x to node y. 
neighbors(G, x): lists all nodes y such that there is an edge from x to y. 
add(G, x, y): adds to G the edge from x to y, if it is not there. 
delete(G, x, y): removes the edge from x to y, if it is there. 
get_node_value(G, x): returns the value associated with the node x. 
set_node_value(G, x, a): sets the value associated with the node x to a. 
Structures that associate values to the edges usually also provide:

get_edge_value(G, x, y): returns the value associated to the edge (x,y). 
set_edge_value(G, x, y, v): sets the value associated to the edge (x,y) to v. 
[edit] RepresentationsDifferent data structures for the representation of graphs are used in practice:

Adjacency list - An adjacency list is implemented as an array of lists, with one list of destination nodes for each source node. 
Incidence list - A variant of the adjacency list that allows for the description of the edges at the cost of additional edges. 
Adjacency matrix - A two-dimensional Boolean matrix, in which the rows and columns represent source and destination vertices and entries in the matrix indicate whether an edge exists between the vertices associated with that row and column. 
Incidence matrix - A two-dimensional Boolean matrix, in which the rows represent the vertices and columns represent the edges. The array entries indicate if both are related, i.e. incident. 
Adjacency lists are generally preferred because they efficiently represent sparse graphs. An adjacency matrix is preferred if the graph is dense, that is the number of edges E is close to the number of vertices squared, V2, or if one must be able to quickly look up if there is an edge connecting two vertices. [1]

For graphs with some regularity in the placement of edges, a symbolic graph is a possible choice of representation.

[edit] AlgorithmsGraph algorithms are a significant field of interest within computer science. Typical higher-level operations associated with graphs are: finding a path between two nodes, like depth-first search and breadth-first search and finding the shortest path from one node to another, like Dijkstra's algorithm. A solution to finding the shortest path from each node to every other node also exists in the form of the Floyd-Warshall algorithm.

A directed graph can be seen as a flow network, where each edge has a capacity and each edge receives a flow. The Ford-Fulkerson algorithm is used to find out the maximum flow from a source to a sink in a graph.

In mathematics, a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected objects are represented by mathematical abstractions called vertices, and the links that connect some pairs of vertices are called edges. Typically, a graph is depicted in diagrammatic form as a set of dots for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.

The edges may be directed (asymmetric) or undirected (symmetric). For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this is an undirected graph, because if person A shook hands with person B, then person B also shook hands with person A. On the other hand, if the vertices represent people at a party, and there is an edge from person A to person B when person A knows of person B, then this graph is directed, because knowing of someone is not necessarily a symmetric relation (that is, one person knowing of another person does not necessarily imply the reverse; for example, many fans may know of a celebrity, but the celebrity is unlikely to know of all their fans). This latter type of graph is called a directed graph and the edges are called directed edges or arcs; in contrast, a graph where the edges are not directed is called undirected.

Vertices are also called nodes or points, and edges are also called lines. Graphs are the basic subject studied by graph theory. The word "graph" was first used in this sense by James Joseph Sylvester in 1878.[1]

Contents [hide]
1 Definitions 
1.1 Graph 
1.2 Adjacency relation 
2 Types of graphs 
2.1 Distinction in terms of the main definition 
2.1.1 Undirected graph 
2.1.2 Directed graph 
2.1.3 Mixed graph 
2.1.4 Multigraph 
2.1.5 Simple graph 
2.1.6 Weighted graph 
2.1.7 Half-edges, loose edges 
2.2 Important graph classes 
2.2.1 Regular graph 
2.2.2 Complete graph 
2.2.3 Finite and infinite graphs 
2.2.4 Graph classes in terms of connectivity 
3 Properties of graphs 
4 Examples 
5 Important graphs 
6 Operations on graphs 
7 Generalizations 
8 See also 
9 Notes 
10 References 
11 External links 
 
[edit] DefinitionsDefinitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures.

[edit] Graph 
A general example of a graph (actually, a pseudograph) with three vertices and six edges.In the most common sense of the term,[2] a graph is an ordered pair G = (V, E) comprising a set V of vertices or nodes together with a set E of edges or lines, which are 2-element subsets of V (i.e., an edge is related with two vertices, and the relation is represented as unordered pair of the vertices with respect to the particular edge). To avoid ambiguity, this type of graph may be described precisely as undirected and simple.

Other senses of graph stem from different conceptions of the edge set. In one more generalized notion,[3] E is a set together with a relation of incidence that associates with each edge two vertices. In another generalized notion, E is a multiset of unordered pairs of (not necessarily distinct) vertices. Many authors call this type of object a multigraph or pseudograph.

All of these variants and others are described more fully below.

The vertices belonging to an edge are called the ends, endpoints, or end vertices of the edge. A vertex may exist in a graph and not belong to an edge.

V and E are usually taken to be finite, and many of the well-known results are not true (or are rather different) for infinite graphs because many of the arguments fail in the infinite case. The order of a graph is | V | (the number of vertices). A graph's size is | E | , the number of edges. The degree of a vertex is the number of edges that connect to it, where an edge that connects to the vertex at both ends (a loop) is counted twice.

For an edge {u, v}, graph theorists usually use the somewhat shorter notation uv.


[edit] Adjacency relationThe edges E of an undirected graph G induce a symmetric binary relation ~ on V that is called the adjacency relation of G. Specifically, for each edge {u, v} the vertices u and v are said to be adjacent to one another, which is denoted u ~ v.

[edit] Types of graphs[edit] Distinction in terms of the main definitionAs stated above, in different contexts it may be useful to define the term graph with different degrees of generality. Whenever it is necessary to draw a strict distinction, the following terms are used. Most commonly, in modern texts in graph theory, unless stated otherwise, graph means "undirected simple finite graph" (see the definitions below).

[edit] Undirected graphA graph in which edges have no orientation, i.e., they are not ordered pairs, but sets {u, v} (or 2-multisets) of vertices.

[edit] Directed graph 
A directed graph.Main article: Digraph (mathematics)
A directed graph or digraph is an ordered pair D = (V, A) with

V a set whose elements are called vertices or nodes, and 
A a set of ordered pairs of vertices, called arcs, directed edges, or arrows. 
An arc a = (x, y) is considered to be directed from x to y; y is called the head and x is called the tail of the arc; y is said to be a direct successor of x, and x is said to be a direct predecessor of y. If a path leads from x to y, then y is said to be a successor of x and reachable from x, and x is said to be a predecessor of y. The arc (y, x) is called the arc (x, y) inverted.

A directed graph D is called symmetric if, for every arc in D, the corresponding inverted arc also belongs to D. A symmetric loopless directed graph D = (V, A) is equivalent to a simple undirected graph G = (V, E), where the pairs of inverse arcs in A correspond 1-to-1 with the edges in E; thus the edges in G number |E| = |A|/2, or half the number of arcs in D.

A variation on this definition is the oriented graph, in which not more than one of (x, y) and (y, x) may be arcs.

[edit] Mixed graphA mixed graph G is a graph in which some edges may be directed and some may be undirected. It is written as an ordered triple G = (V, E, A) with V, E, and A defined as above. Directed and undirected graphs are special cases.

[edit] MultigraphA loop is an edge (directed or undirected) which starts and ends on the same vertex; these may be permitted or not permitted according to the application. In this context, an edge with two different ends is called a link.

The term "multigraph" is generally understood to mean that multiple edges (and sometimes loops) are allowed. Where graphs are defined so as to allow loops and multiple edges, a multigraph is often defined to mean a graph without loops,[4] however, where graphs are defined so as to disallow loops and multiple edges, the term is often defined to mean a "graph" which can have both multiple edges and loops,[5] although many use the term "pseudograph" for this meaning.[6]

[edit] Simple graph 
A simple graph with three vertices and three edges. Each vertex has degree two, so this is also a regular graph.As opposed to a multigraph, a simple graph is an undirected graph that has no loops and no more than one edge between any two different vertices. In a simple graph the edges of the graph form a set (rather than a multiset) and each edge is a pair of distinct vertices. In a simple graph with n vertices every vertex has a degree that is less than n (the converse, however, is not true - there exist non-simple graphs with n vertices in which every vertex has a degree smaller than n).

[edit] Weighted graphA graph is a weighted graph if a number (weight) is assigned to each edge. Such weights might represent, for example, costs, lengths or capacities, etc. depending on the problem.

The weight of the graph is the sum of the weights given to all edges.

[edit] Half-edges, loose edgesIn exceptional situations it is even necessary to have edges with only one end, called half-edges, or no ends (loose edges); see for example signed graphs and biased graphs.

[edit] Important graph classes[edit] Regular graphMain article: Regular graph
A regular graph is a graph where each vertex has the same number of neighbors, i.e., every vertex has the same degree or valency. A regular graph with vertices of degree k is called a k‑regular graph or regular graph of degree k.

[edit] Complete graph 
A complete graph with 5 vertices. Each vertex has an edge to every other vertex.Main article: Complete graph
Complete graphs have the feature that each pair of vertices has an edge connecting them.

[edit] Finite and infinite graphsA finite graph is a graph G = (V, E) such that V and E are finite sets. An infinite graph is one with an infinite set of vertices or edges or both.

Most commonly in graph theory it is implied that the graphs discussed are finite. If the graphs are infinite, that is usually specifically stated.

[edit] Graph classes in terms of connectivityMain article: Connectivity (graph theory)
In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. A graph is called connected if every pair of distinct vertices in the graph is connected; otherwise, it is called disconnected.

A graph is called k-vertex-connected or k-edge-connected if no set of k-1 vertices (respectively, edges) exists that disconnects the graph. A k-vertex-connected graph is often called simply k-connected.

A directed graph is called weakly connected if replacing all of its directed edges with undirected edges produces a connected (undirected) graph. It is strongly connected or strong if it contains a directed path from u to v and a directed path from v to u for every pair of vertices u, v.

[edit] Properties of graphsSee also: Glossary of graph theory and Graph property
Two edges of a graph are called adjacent (sometimes coincident) if they share a common vertex. Two arrows of a directed graph are called consecutive if the head of the first one is at the nock (notch end) of the second one. Similarly, two vertices are called adjacent if they share a common edge (consecutive if they are at the notch and at the head of an arrow), in which case the common edge is said to join the two vertices. An edge and a vertex on that edge are called incident.

The graph with only one vertex and no edges is called the trivial graph. A graph with only vertices and no edges is known as an edgeless graph. The graph with no vertices and no edges is sometimes called the null graph or empty graph, but the terminology is not consistent and not all mathematicians allow this object.

In a weighted graph or digraph, each edge is associated with some value, variously called its cost, weight, length or other term depending on the application; such graphs arise in many contexts, for example in optimal routing problems such as the traveling salesman problem.

Normally, the vertices of a graph, by their nature as elements of a set, are distinguishable. This kind of graph may be called vertex-labeled. However, for many questions it is better to treat vertices as indistinguishable; then the graph may be called unlabeled. (Of course, the vertices may be still distinguishable by the properties of the graph itself, e.g., by the numbers of incident edges). The same remarks apply to edges, so that graphs which have labeled edges are called edge-labeled graphs. Graphs with labels attached to edges or vertices are more generally designated as labeled. Consequently, graphs in which vertices are indistinguishable and edges are indistinguishable are called unlabeled. (Note that in the literature the term labeled may apply to other kinds of labeling, besides that which serves only to distinguish different vertices or edges.)

[edit] Examples 
A graph with six nodes.The diagram at right is a graphic representation of the following graph: 
V = {1, 2, 3, 4, 5, 6} 
E = {{1, 2}, {1, 5}, {2, 3}, {2, 5}, {3, 4}, {4, 5}, {4, 6}}. 
In category theory a small category can be represented by a directed multigraph in which the objects of the category represented as vertices and the morphisms as directed edges. Then, the functors between categories induce some, but not necessarily all, of the digraph morphisms of the graph. 
In computer science, directed graphs are used to represent knowledge (e.g., Conceptual graph), finite state machines, and many other discrete structures. 
A binary relation R on a set X defines a directed graph. An element x of X is a direct predecessor of an element y of X iff xRy. 
[edit] Important graphsBasic examples are:

In a complete graph, each pair of vertices is joined by an edge; that is, the graph contains all possible edges. 
In a bipartite graph, the vertex set can be partitioned into two sets, W and X, so that no two vertices in W are adjacent and no two vertices in X are adjacent. Alternatively, it is a graph with a chromatic number of 2. 
In a complete bipartite graph, the vertex set is the union of two disjoint sets, W and X, so that every vertex in W is adjacent to every vertex in X but there are no edges within W or X. 
In a linear graph or path graph of length n, the vertices can be listed in order, v0, v1, ..., vn, so that the edges are vi−1vi for each i = 1, 2, ..., n. If a linear graph occurs as a subgraph of another graph, it is a path in that graph. 
In a cycle graph of length n ≥ 3, vertices can be named v1, ..., vn so that the edges are vi−1vi for each i = 2,...,n in addition to vnv1. Cycle graphs can be characterized as connected 2-regular graphs. If a cycle graph occurs as a subgraph of another graph, it is a cycle or circuit in that graph. 
A planar graph is a graph whose vertices and edges can be drawn in a plane such that no two of the edges intersect (i.e., embedded in a plane). 
A tree is a connected graph with no cycles. 
A forest is a graph with no cycles (i.e. the disjoint union of one or more trees). 
More advanced kinds of graphs are:

The Petersen graph and its generalizations 
Perfect graphs 
Cographs 
Other graphs with large automorphism groups: vertex-transitive, arc-transitive, and distance-transitive graphs. 
Strongly regular graphs and their generalization distance-regular graphs. 
[edit] Operations on graphsMain article: Operations on graphs
There are several operations that produce new graphs from old ones, which might be classified into the following categories:

Elementary operations, sometimes called "editing operations" on graphs, which create a new graph from the original one by a simple, local change, such as addition or deletion of a vertex or an edge, merging and splitting of vertices, etc. 
Graph rewrite operations replacing the occurrence of some pattern graph within the host graph by an instance of the corresponding replacement graph. 
Unary operations, which create a significantly new graph from the old one. Examples: 
Line graph 
Dual graph 
Complement graph 
Binary operations, which create new graph from two initial graphs. Examples: 
Disjoint union of graphs 
Cartesian product of graphs 
Tensor product of graphs 
Strong product of graphs 
Lexicographic product of graphs 
[edit] GeneralizationsIn a hypergraph, an edge can join more than two vertices.

An undirected graph can be seen as a simplicial complex consisting of 1-simplices (the edges) and 0-simplices (the vertices). As such, complexes are generalizations of graphs since they allow for higher-dimensional simplices.

Every graph gives rise to a matroid.

In model theory, a graph is just a structure. But in that case, there is no limitation on the number of edges: it can be any cardinal number, see continuous graph.

In computational biology, power graph analysis introduces power graphs as an alternative representation of undirected graphs.

[edit] See alsoDual graph 
Glossary of graph theory 
Graph (data structure) 
Graph database 
Graph drawing 
Graph theory publications 
List of graph theory topics 
Network theory 
Conceptual graph 
Horizontal constraint graph 
Causal dynamical triangulation 
Sage Math (software) 
NetworkX (software) 
In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to model pairwise relations between objects from a certain collection. A "graph" in this context refers to a collection of vertices or 'nodes' and a collection of edges that connect pairs of vertices. A graph may be undirected, meaning that there is no distinction between the two vertices associated with each edge, or its edges may be directed from one vertex to another; see graph (mathematics) for more detailed definitions and for other variations in the types of graphs that are commonly considered. The graphs studied in graph theory should not be confused with [[graphs of functions] or other kinds of graphs.

Graphs are one of the prime objects of study in Discrete Mathematics. Refer to Glossary of graph theory for basic definitions in graph theory.

Contents [hide]
1 History 
2 Drawing graphs 
3 Graph-theoretic data structures 
3.1 List structures 
3.2 Matrix structures 
4 Problems in graph theory 
4.1 Enumeration 
4.2 Subgraphs, induced subgraphs, and minors 
4.3 Graph coloring 
4.4 Route problems 
4.5 Network flow 
4.6 Visibility graph problems 
4.7 Covering problems 
4.8 Graph classes 
5 Applications 
6 See also 
6.1 Related topics 
6.2 Algorithms 
6.3 Subareas 
6.4 Related areas of mathematics 
6.5 Generalizations 
6.6 Prominent graph theorists 
7 Notes 
8 References 
9 External links 
9.1 Online textbooks 
9.2 Other resources 
 
[edit] History 
The Königsberg Bridge problemThe paper written by Leonhard Euler on the Seven Bridges of Königsberg and published in 1736 is regarded as the first paper in the history of graph theory.[1] This paper, as well as the one written by Vandermonde on the knight problem, carried on with the analysis situs initiated by Leibniz. Euler's formula relating the number of edges, vertices, and faces of a convex polyhedron was studied and generalized by Cauchy[2] and L'Huillier,[3] and is at the origin of topology.

More than one century after Euler's paper on the bridges of Königsberg and while Listing introduced topology, Cayley was led by the study of particular analytical forms arising from differential calculus to study a particular class of graphs, the trees. This study had many implications in theoretical chemistry. The involved techniques mainly concerned the enumeration of graphs having particular properties. Enumerative graph theory then rose from the results of Cayley and the fundamental results published by Pólya between 1935 and 1937 and the generalization of these by De Bruijn in 1959. Cayley linked his results on trees with the contemporary studies of chemical composition.[4] The fusion of the ideas coming from mathematics with those coming from chemistry is at the origin of a part of the standard terminology of graph theory.

In particular, the term "graph" was introduced by Sylvester in a paper published in 1878 in Nature, where he draws an analogy between "quantic invariants" and "co-variants" of algebra and molecular diagrams:[5]

"[...] Every invariant and co-variant thus becomes expressible by a graph precisely identical with a Kekuléan diagram or chemicograph. [...] I give a rule for the geometrical multiplication of graphs, i.e. for constructing a graph to the product of in- or co-variants whose separate graphs are given. [...]" (italics as in the original). 
One of the most famous and productive problems of graph theory is the four color problem: "Is it true that any map drawn in the plane may have its regions colored with four colors, in such a way that any two regions having a common border have different colors?" This problem was first posed by Francis Guthrie in 1852 and its first written record is in a letter of De Morgan addressed to Hamilton the same year. Many incorrect proofs have been proposed, including those by Cayley, Kempe, and others. The study and the generalization of this problem by Tait, Heawood, Ramsey and Hadwiger led to the study of the colorings of the graphs embedded on surfaces with arbitrary genus. Tait's reformulation generated a new class of problems, the factorization problems, particularly studied by Petersen and Kőnig. The works of Ramsey on colorations and more specially the results obtained by Turán in 1941 was at the origin of another branch of graph theory, extremal graph theory.

The four color problem remained unsolved for more than a century. In 1969 Heinrich Heesch published a method for solving the problem using computers.[6] A computer-aided proof produced in 1976 by Kenneth Appel and Wolfgang Haken makes fundamental use of the notion of "discharging" developed by Heesch.[7][8] The proof involved checking the properties of 1,936 configurations by computer, and was not fully accepted at the time due to its complexity. A simpler proof considering only 633 configurations was given twenty years later by Robertson, Seymour, Sanders and Thomas.[9]

The autonomous development of topology from 1860 and 1930 fertilized graph theory back through the works of Jordan, Kuratowski and Whitney. Another important factor of common development of graph theory and topology came from the use of the techniques of modern algebra. The first example of such a use comes from the work of the physicist Gustav Kirchhoff, who published in 1845 his Kirchhoff's circuit laws for calculating the voltage and current in electric circuits.

The introduction of probabilistic methods in graph theory, especially in the study of Erdős and Rényi of the asymptotic probability of graph connectivity, gave rise to yet another branch, known as random graph theory, which has been a fruitful source of graph-theoretic results.

[edit] Drawing graphsMain article: Graph drawing
Graphs are represented graphically by drawing a dot or circle for every vertex, and drawing an arc between two vertices if they are connected by an edge. If the graph is directed, the direction is indicated by drawing an arrow.

A graph drawing should not be confused with the graph itself (the abstract, non-visual structure) as there are several ways to structure the graph drawing. All that matters is which vertices are connected to which others by how many edges and not the exact layout. In practice it is often difficult to decide if two drawings represent the same graph. Depending on the problem domain some layouts may be better suited and easier to understand than others.

[edit] Graph-theoretic data structuresMain article: Graph (data structure)
There are different ways to store graphs in a computer system. The data structure used depends on both the graph structure and the algorithm used for manipulating the graph. Theoretically one can distinguish between list and matrix structures but in concrete applications the best structure is often a combination of both. List structures are often preferred for sparse graphs as they have smaller memory requirements. Matrix structures on the other hand provide faster access for some applications but can consume huge amounts of memory.

[edit] List structuresIncidence list  
The edges are represented by an array containing pairs (tuples if directed) of vertices (that the edge connects) and possibly weight and other data. Vertices connected by an edge are said to be adjacent. 
Adjacency list  
Much like the incidence list, each vertex has a list of which vertices it is adjacent to. This causes redundancy in an undirected graph: for example, if vertices A and B are adjacent, A's adjacency list contains B, while B's list contains A. Adjacency queries are faster, at the cost of extra storage space. 
[edit] Matrix structuresIncidence matrix  
The graph is represented by a matrix of size |V | (number of vertices) by |E| (number of edges) where the entry [vertex, edge] contains the edge's endpoint data (simplest case: 1 - incident, 0 - not incident). 
Adjacency matrix  
This is an n by n matrix A, where n is the number of vertices in the graph. If there is an edge from a vertex x to a vertex y, then the element ax,y is 1 (or in general the number of xy edges), otherwise it is 0. In computing, this matrix makes it easy to find subgraphs, and to reverse a directed graph. 
Laplacian matrix or Kirchhoff matrix or Admittance matrix  
This is defined as D − A, where D is the diagonal degree matrix. It explicitly contains both adjacency information and degree information. (However, there are other, similar matrices that are also called "Laplacian matrices" of a graph.) 
Distance matrix  
A symmetric n by n matrix D whose element dx,y is the length of a shortest path between x and y; if there is no such path dx,y = infinity. It can be derived from powers of A 
 
[edit] Problems in graph theory[edit] EnumerationThere is a large literature on graphical enumeration: the problem of counting graphs meeting specified conditions. Some of this work is found in Harary and Palmer (1973).

[edit] Subgraphs, induced subgraphs, and minorsA common problem, called the subgraph isomorphism problem, is finding a fixed graph as a subgraph in a given graph. One reason to be interested in such a question is that many graph properties are hereditary for subgraphs, which means that a graph has the property if and only if all subgraphs have it too. Unfortunately, finding maximal subgraphs of a certain kind is often an NP-complete problem.

Finding the largest complete graph is called the clique problem (NP-complete). 
A similar problem is finding induced subgraphs in a given graph. Again, some important graph properties are hereditary with respect to induced subgraphs, which means that a graph has a property if and only if all induced subgraphs also have it. Finding maximal induced subgraphs of a certain kind is also often NP-complete. For example,

Finding the largest edgeless induced subgraph, or independent set, called the independent set problem (NP-complete). 
Still another such problem, the minor containment problem, is to find a fixed graph as a minor of a given graph. A minor or subcontraction of a graph is any graph obtained by taking a subgraph and contracting some (or no) edges. Many graph properties are hereditary for minors, which means that a graph has a property if and only if all minors have it too. A famous example:

A graph is planar if it contains as a minor neither the complete bipartite graph K3,3 (See the Three-cottage problem) nor the complete graph K5. 
Another class of problems has to do with the extent to which various species and generalizations of graphs are determined by their point-deleted subgraphs, for example:

The reconstruction conjecture 
[edit] Graph coloringMany problems have to do with various ways of coloring graphs, for example:

The four-color theorem 
The strong perfect graph theorem 
The Erdős–Faber–Lovász conjecture (unsolved) 
The total coloring conjecture (unsolved) 
The list coloring conjecture (unsolved) 
The Hadwiger conjecture (graph theory) (unsolved) 
[edit] Route problemsHamiltonian path and cycle problems 
Minimum spanning tree 
Route inspection problem (also called the "Chinese Postman Problem") 
Seven Bridges of Königsberg 
Shortest path problem 
Steiner tree 
Three-cottage problem 
Traveling salesman problem (NP-complete) 
[edit] Network flowThere are numerous problems arising especially from applications that have to do with various notions of flows in networks, for example:

Max flow min cut theorem 
[edit] Visibility graph problemsMuseum guard problem 
[edit] Covering problemsCovering problems are specific instances of subgraph-finding problems, and they tend to be closely related to the clique problem or the independent set problem.

Set cover problem 
Vertex cover problem 
[edit] Graph classesMany problems involve characterizing the members of various classes of graphs. Overlapping significantly with other types in this list, this type of problem includes, for instance:

Enumerating the members of a class 
Characterizing a class in terms of forbidden substructures 
Ascertaining relationships among classes (e.g., does one property of graphs imply another) 
Finding efficient algorithms to decide membership in a class 
Finding representations for members of a class 
[edit] ApplicationsGraphs are among the most ubiquitous models of both natural and human-made structures. They can be used to model many types of relations and process dynamics in physical, biological and social systems. Many problems of practical interest can be represented by graphs.

In computer science, graphs are used to represent networks of communication, data organization, computational devices, the flow of computation, etc. One practical example: The link structure of a website could be represented by a directed graph. The vertices are the web pages available at the website and a directed edge from page A to page B exists if and only if A contains a link to B. A similar approach can be taken to problems in travel, biology, computer chip design, and many other fields. The development of algorithms to handle graphs is therefore of major interest in computer science. There, the transformation of graphs is often formalized and represented by graph rewrite systems. They are either directly used or properties of the rewrite systems (e.g. confluence) are studied. Complementary to graph transformation systems focussing on rule-based in-memory manipulation of graphs are graph databases geared towards transaction-safe, persistent storing and querying of graph-structured data.

Graph-theoretic methods, in various forms, have proven particularly useful in linguistics, since natural language often lends itself well to discrete structure. Traditionally, syntax and compositional semantics follow tree-based structures, whose expressive power lies in the Principle of Compositionality, modeled in a hierarchical graph. Within lexical semantics, especially as applied to computers, modeling word meaning is easier when a given word is understood in terms of related words; semantic networks are therefore important in computational linguistics. Still other methods in phonology (e.g. Optimality Theory, which uses lattice graphs) and morphology (e.g. finite-state morphology, using finite-state transducers) are common in the analysis of language as a graph. Indeed, the usefulness of this area of mathematics to linguistics has borne organizations such as TextGraphs, as well as various 'Net' projects, such as WordNet, VerbNet, and others.

Graph theory is also used to study molecules in chemistry and physics. In condensed matter physics, the three dimensional structure of complicated simulated atomic structures can be studied quantitatively by gathering statistics on graph-theoretic properties related to the topology of the atoms. For example, Franzblau's shortest-path (SP) rings. In chemistry a graph makes a natural model for a molecule, where vertices represent atoms and edges bonds. This approach is especially used in computer processing of molecular structures, ranging from chemical editors to database searching. In statistical physics, graphs can represent local connections between interacting parts of a system, as well as the dynamics of a physical process on such systems.

Graph theory is also widely used in sociology as a way, for example, to measure actors' prestige or to explore diffusion mechanisms, notably through the use of social network analysis software.

Likewise, graph theory is useful in biology and conservation efforts where a vertex can represent regions where certain species exist (or habitats) and the edges represent migration paths, or movement between the regions. This information is important when looking at breeding patterns or tracking the spread of disease, parasites or how changes to the movement can affect other species.

In mathematics, graphs are useful in geometry and certain parts of topology, e.g. Knot Theory. Algebraic graph theory has close links with group theory.

A graph structure can be extended by assigning a weight to each edge of the graph. Graphs with weights, or weighted graphs, are used to represent structures in which pairwise connections have some numerical values. For example if a graph represents a road network, the weights could represent the length of each road.

A digraph with weighted edges in the context of graph theory is called a network. Network analysis have many practical applications, for example, to model and analyze traffic networks. Applications of network analysis split broadly into three categories:

First, analysis to determine structural properties of a network, such as the distribution of vertex degrees and the diameter of the graph. A vast number of graph measures exist, and the production of useful ones for various domains remains an active area of research. 
Second, analysis to find a measurable quantity within the network, for example, for a transportation network, the level of vehicular flow within any portion of it. 
Third, analysis of dynamical properties of networks. 
[edit] See alsoGallery of named graphs 
Glossary of graph theory 
List of graph theory topics 
Publications in graph theory 
[edit] Related topicsGraph property 
Algebraic graph theory 
Conceptual graph 
Data structure 
Disjoint-set data structure 
Entitative graph 
Existential graph 
Graph data structure 
Graph algebras 
Graph automorphism 
Graph coloring 
Graph database 
Graph drawing 
Graph equation 
Graph rewriting 
Intersection graph 
Logical graph 
Loop 
Null graph 
Pebble motion problems 
Perfect graph 
Quantum graph 
Spectral graph theory 
Strongly regular graphs 
Symmetric graphs 
Tree data structure 
[edit] AlgorithmsBellman-Ford algorithm 
Dijkstra's algorithm 
Ford-Fulkerson algorithm 
Kruskal's algorithm 
Nearest neighbour algorithm 
Prim's algorithm 
Depth-first search 
Breadth-first search 
[edit] SubareasAlgebraic graph theory 
Geometric graph theory 
Extremal graph theory 
Probabilistic graph theory 
Topological graph theory 
[edit] Related areas of mathematicsCombinatorics 
Group theory 
Knot theory 
Ramsey theory 
[edit] GeneralizationsHypergraph 
Abstract simplicial complex 
